A Complete Classification of Digital (0,m, 3)-Nets and Digital (0, 2)-Sequences in Base 2
نویسندگان
چکیده
منابع مشابه
Bounds for digital nets and sequences
1. Introduction. Currently, the most effective constructions of low-discrepancy point sets and sequences, which are of great importance for quasi-Monte Carlo methods in multidimensional numerical integration, are based on the concept of (t, m, s)-nets and (t, s)-sequences. A detailed theory was developed in Niederreiter [9] (see also [10, Chapter 4] for surveys of this theory). So-called digita...
متن کاملSome Geometric and Combinatorial Properties of (0; M; 2)-nets in Base B 2
In this paper, we study the geometric generation of the (0; m; 2)-nets. Based on some combinatorial methods, a generation property on (0; m; 2)-nets with an applications to a Sobol' sequence and the number of the (0; m; 2)-nets in equivalent sense are given. We also present some symmetry properties of the Sobol' sequence and the Roth-Zaremba sequence.
متن کاملIrregularities of Distribution of Digital (0,1)-sequences in Prime Base
In this paper, as an application of our recent results to appear elsewhere [5], we compare digital (0, 1)-sequences generated by nonsingular upper triangular matrices in arbitrary prime bases to van der Corput sequences and show these last ones are the worst distributed with respect to the star discrepancy, the extreme discrepancy, the L2-discrepancy and the diaphony. Moreover, we obtain digita...
متن کامل6 Concluding Remarks 5.2 Incorporate Database Categorization 5 Improving the Retrieval of Relevant Documents = 2:0m 2 2 2 2 2 2 2 2 2 2 2 = 2:0m 2 2 2 2 2 2 2 2 2 2 2
In this paper, we proposed a new, highly scalable method to solve the database selection problem when the number of local databases in a metasearch engine is very large. For single-term queries, this method guarantees all desired documents to be retrieved. Experiments were conducted to show that this method is very eeective for typical short Internet queries. We also illustrated that the our da...
متن کاملF 0 1 2 3 2 N ? 2 2 N ? 1 0 0 0 0 0 0 0 1 1 2 2 2 2 2
13 Proof: R private (f) C private (f) since in any protocol the parties send at least one bit per round. On the other hand, for every privately computable function f the bound R private (f) is achieved by the protocol A f. In any round of this protocol the parties send a message with size at most n. (Note that in steps (2a) and (2b) of A f we may save one bit per round by omitting the most sign...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Uniform distribution theory
سال: 2019
ISSN: 2309-5377
DOI: 10.2478/udt-2019-0004